Fair Scheduling via Iterative Quasi-Uniform Sampling | Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
نویسندگان
چکیده
In the paper we consider minimizing the `k-norms of flow time on a single machine offline using a preemptive scheduler for k ≥ 1. We show the first O(1)approximation for the problem, improving upon the previous best O(log logP )-approximation by Bansal and Pruhs (FOCS 09 and SICOMP 14) where P is the ratio of the maximum job size to the minimum. Our main technical ingredient is a novel combination of quasi-uniform sampling and iterative rounding, which is of interest in its own right.
منابع مشابه
On Rationality of Nonnegative Matrix Factorization | Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n × m matrix M into a product of a nonnegative n×d matrix W and a nonnegative d×m matrix H. NMF has a wide variety of applications, including bioinformatics, chemometrics, communication complexity, machine learning, polyhedral combinatorics, among many others. A longstanding open question, posed by Cohen an...
متن کاملRandom Walks and Evolving Sets: Faster Convergences and Limitations | Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
Analyzing the mixing time of random walks is a wellstudied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more combinatorial graph structures, and show some implications in approximating small-set expansion. On the other hand, we provide examples showing the limitations of using ...
متن کاملOptimal Algorithms for Testing Closeness of Discrete Distributions | Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
We study the question of closeness testing for two discrete distributions. More precisely, given samples from two distributions p and q over an n-element set, we wish to distinguish whether p = q versus p is at least ε-far from q, in either `1 or `2 distance. Batu et al [BFR00, BFR13] gave the first sub-linear time algorithms for these problems, which matched the lower bounds of [Val11] up to a...
متن کاملCombinatorial Auctions via Posted Prices | Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
We study anonymous posted price mechanisms for combinatorial auctions in a Bayesian framework. In a posted price mechanism, item prices are posted, then the consumers approach the seller sequentially in an arbitrary order, each purchasing her favorite bundle from among the unsold items at the posted prices. These mechanisms are simple, transparent and trivially dominant strategy incentive compa...
متن کاملSampling Algorithms and Coresets
The p regression problem takes as input a matrix A ∈ Rn×d, a vector b ∈ Rn, and a number p ∈ [1,∞), and it returns as output a number Z and a vector xopt ∈ Rd such that Z = minx∈Rd ‖Ax− b‖p = ‖Axopt − b‖p. In this paper, we construct coresets and obtain an efficient two-stage sampling-based approximation algorithm for the very overconstrained (n d) version of this classical problem, for all p ∈...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016